The Crystallographic Restriction, Permutations, and Goldbach's Conjecture
نویسندگان
چکیده
1. INTRODUCTION. The object of this paper is to make an observation connecting Goldbach's conjecture, the crystallographic restriction, and the orders of the elements of the symmetric group. First recall that for an element g of a group G the order Ord(g) of g is defined to be the smallest natural number such that g
منابع مشابه
The Combinatorics behind Number-Theoretic Sieves
Ever since Viggo Brun's pioneering work, number theorists have developed increasingly sophisticated re nements of the sieve of Eratosthenes to attack problems such as the twin prime conjecture and Goldbach's conjecture. Ever since Gian-Carlo Rota's pioneering work, combinatorialists have found more and more areas of combinatorics where sieve methods (or M obius inversion) are applicable. Unfor...
متن کاملGoldbach's Conjecture on ECDSA Protocols
In this paper, an algorithm on Goldbach’s conjecture is newly defined for computing a large even number as a sum of two primes or a sum of prime and composite. Using the conjecture, an ECDSA (Elliptic Curve Digital Signature Algorithm) protocol is newly proposed for authentication. The protocol describes the process of key generation, signature generation and signature verification as well as s...
متن کاملA Study of Relationship between RSA Public Key Cryptosystem and Goldbach's Conjecture Properties
The Goldbach’s conjecture has plagued mathematicians for over two hundred and seventy years. Whether professionals or amateur enthusiasts, all have been fascinated by this question. Why do mathematicians have no way to solve this problem? Till now, Chen has been recognized for the most concise proof his “1 + 2” theorem in 1973. In this article the authors will use elementary concepts to describ...
متن کاملA Study of Goldbach's conjecture and Polignac's conjecture equivalence issues
The famous Goldbach’s conjecture and Polignac’s conjecture are two of all unsolved problems in the field of number theory today. As well known, the Goldbach’s conjecture and the Polignac’s conjecture are equivalent. Most of the literatures does not introduce about internal equivalence in Polignac’s conjecture. In this paper, we would like to discuss the internal equivalence to the Polignac’s co...
متن کاملPacking densities of layered permutations and the minimum number of monotone sequences in layered permutations
In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from Hästö (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence is (1, l1, l2, . . . , lk) with 2−a−1 ≥ k (and similar permutations). As a second result, we prove that the minimum density of monotone sequences of length k + 1 in an arbitraril...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- The American Mathematical Monthly
دوره 110 شماره
صفحات -
تاریخ انتشار 2003